Hybrid Transitive Closure Algorithms
نویسندگان
چکیده
We present a new family of hybrid transitive closure algorithms, and present experimental results showing that these algorithms perform better than existing transitive closure algorithms, includmg matrix-based algorithms that divide a matrix into stripes or into square blocks, and graph-based algmtihms. This family of algorithms can be generalized to solve path problems and to solve problems in which some selection criteria have been specified for source or destination nodes.
منابع مشابه
The Effect of Transitive Closure on the Calibration of Logistic Regression for Entity Resolution
This paper describes a series of experiments in using logistic regression machine learning as a method for entity resolution. From these experiments the authors concluded that when a supervised ML algorithm is trained to classify a pair of entity references as linked or not linked pair, the evaluation of the model’s performance should take into account the transitive closure of its pairwise lin...
متن کاملEecient Transitive Closure Computation
We present two new transitive closure algorithms that are based on strong component detection. The algorithms scan the input graph only once without generating partial successor sets for each node. The new algorithms eliminate the redundancy caused by strong components more e ciently than previous transitive closure algorithms. We present statistically sound simulation experiments showing that ...
متن کاملBSP/CGM Algorithms for the Transitive Closure Problem
We present new implementations of BSP/CGM algorithms for the Transitive Closure Problem. Our strategies deal with size of the message and communication rounds, problems that cause inefficiency in the implementations of the transitive closure algorithms. The algorithms were implemented using LAM/MPI in two Beowulfs. The implementation results show the efficiency and scalability of the presented ...
متن کاملEfficient Transitive Closure Algorithms
We have developed some efficient algorithms for computing the transitive closure of a directed graph. This paper presents the algorithms for the problem of reachability. The algorithms, however, can be adapted to deal with path computations and a signitkantJy broader class of queries based on onesided recursions. We analyze these algorithms and compare them to algorithms in the literature. The ...
متن کاملTransitive Closure and the LOGA+-Strategy for its Efficient Evaluation
One of the key problems when extending relational database query languages to include deductive capabilities, is to provide them with efficient methods for answering recursive queries. During the last few years many algorithms have been proposed to deal with transitive closure computation of a relation. In this paper, we discuss some important criteria for developing transitive closure algorith...
متن کامل